Multi-agent flocking under topological interactions
نویسندگان
چکیده
منابع مشابه
Multi-agent flocking under topological interactions
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by the so-called topological interaction rule: agents interact with a fixed number of their closest neighbors. This rule comes from observations of real flock of starlings. The non-symmetry of the interactions adds to the difficulty of the analysis. The...
متن کاملA flocking algorithm for multi-agent systems with connectivity preservation under hybrid metric-topological interactions
In this paper, we propose a connectivity-preserving flocking algorithm for multi-agent systems in which the neighbor set of each agent is determined by the hybrid metric-topological distance so that the interaction topology can be represented as the range-limited Delaunay graph, which combines the properties of the commonly used disk graph and Delaunay graph. As a result, the proposed flocking ...
متن کاملFinite-time Flocking of Multi-agent System with Input Saturation
In this paper a finite-time flocking of multi-agent system with input saturation is investigated. By introducing a new control protocol, it is show that speed and position of agents with double-integrator dynamics converge to the speed and position of leader in finite time. It is assumed that the graph between the agents is connected and that at least one agent is informed of the leader speed a...
متن کاملMulti-Flock Flocking for Multi-Agent Dynamic Systems
There has been much research done on single-flock flocking Shaw (1975), Partridge (1984), Partridge (1982), Okubo (1986), Reynolds (1987), Vicsek et al. (1995), Toner & Tu (1998), Shimoyama et al. (1996), Mogilner & Edelstein-Keshet (1999), Helbing et al. (2000), Vicsek (2001), Parrish et al. (2002), Olfati-Saber (2006), but none done on multi-flock flocking Gazi & Fidan (2007). One might ask, ...
متن کاملCucker-Smale Flocking Under Hierarchical Leadership and Random Interactions
Consider a flock of birds that fly interacting between them. The interactions are modelled through a hierarchical system in which each bird, at each time step, adjusts its own velocity according to his past velocity and a weighted mean of the relative velocities of its superiors in the hierarchy. We consider the additional fact, that each of the birds can fail to see any of its superiors with c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2014
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2014.04.004